Improved binary discernibility matrix attribute reduction algorithm in customer relationship management
نویسندگان
چکیده
منابع مشابه
Fast Algorithm for Attribute Reduction Based on Rough Set Theory Using Binary Discernibility Matrix
Rough set is a valid mathematical tool that deals with uncertain, vague and incomplete information of decision systems. Attribute reduction is one of the issues in rough set theory, and core attributes are indispensable in the process of attribute reduction. Recently, some researchers proposed the method of binary discernibility matrix to compute the results of attribute reduction, which can no...
متن کاملDiscernibility matrix simplification for constructing attribute reducts
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works in a similar way to the classical Gaussian elimination method for solving a system of linear equations. Elementary matrix simplification operations are introduced. Each operation transforms a matrix into a simpler form. By applying these operations a finite number of times, one can t...
متن کاملIncremental Target Recognition Algorithm Based on Improved Discernibility Matrix
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in our ”Information Fusion System for Communication Interception Information (IFS/CI)”. The results of experimentation illuminate that the new algorithm is more efficient than the previous algorithm.
متن کاملAttribution Reduction Algorithm Based on Improved Binary Dicernibility Matrix
In order to reduce the time and space complexity of algorithm for attribute reduction based on discernibility matrix, and make it can deal directly with inconsistent decision-making system. A modificatory Binary discernibility matrix and attribution reduction algorithm based on binary dicernibility matrix are proposed. An ordering and the simple link in the algorithm have been increased. So red...
متن کاملThe Reduction Algorithm of Concept Lattice Based on the Improved Discernibility Matrix
This article proposes the concept lattice reduction based on the improved discernibility matrix using discernibility matrix of rough set, and with examples, proves that the improved reduction algorithm costs shorter time, makes reduction speed faster, and also saves storage space in comparison with the original discernibility matrix reduction algorithm. Keywordsformal context, concept lattice, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2010
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2010.11.078